Parallel Turing Machines on a Two-Dimensional Tape
نویسندگان
چکیده
We introduce two models of parallel twodimensional Turing machine with different possibilities of communication among control units and we compare them.
منابع مشابه
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape
Dietzfelbinger. hl. and W' hlaass. The complexity of matrrx transposition on one-tape off-line Turing machines with output tape, Thcorettcal A series of existing lower bound results for deterministic one-tape Turing machines is extended to another, stronger such model suttable for the computatton of functions: one-tape off-line Turing machines wtth a wrote-only output tape. (" OfT-line " means:...
متن کاملSynchronized Alternating Turing Machines on Four-Dimensional Input Tapes
Synchronized alternating machine is an alternating machine with a special subset of internal states called synchronizing states. This paper introduces a four-dimensional synchronized alternating Turing machine (4-SATM ), and investigates fundamental properties of 4-SATM ’s. The main topics of this paper are: (1) a relationship between the accepting powers of 4-SATM ’s and four-dimensional alter...
متن کاملComputability of the entropy of one-tape Turing machines
We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision . This is counterintuitive, as all dynamical properties are usually undecidable for Turing machines. The result is quite specific to one-tape Turing machines, as it is not true anymore for two-tape Turing machines by the results of Blondel...
متن کاملCombinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic 1-tape Turing machines (all considered Turing machines have an additional one-way input tape). In particular, we derive for the simulation of 2-tape Turing machines by 1-tape Turing machines an optimal quadratic lower bound in the deterministic case and a nearly optimal lower bound in the nonde...
متن کاملTuring Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کامل